Simple Bounds on the Mean Cycle Time in Acyclic Queueing Networks
نویسنده
چکیده
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the (max,+)-algebra approach.
منابع مشابه
Monotonicity Properties and Simple Bounds on the Mean Cycle Time in Acyclic Fork-Join Queueing Networks
The (max,+ )-algebra approach is applied to establish some monotonicity properties and to get algebraic bounds on the service cycle completion times in acyclic fork-join queueing networks. The obtained results are extended to derive simple lower and upper bounds on the mean cycle time in stochastic networks.
متن کاملAlgebraic modelling and performance evaluation of acyclic fork-join queueing networks
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented. Key-Words: (max,+)-algebra, dynamic state equation, acyclic fo...
متن کاملBounds on mean cycle time in acyclic fork-join queueing networks
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the (max,+)-algebra approach. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.
متن کاملEvaluation of Bounds on Service Cycle Times in Acyclic Fork-Join Queueing Networks
We present a new approach to get bounds on the service cycle time in acyclic forkjoin queueing networks. The approach is based on (max,+)-algebra representation of network dynamics and involves analysis of limiting behaviour of a product of random matrices. As a result, a new upper bound on the cycle time is established which takes into consideration the network topology.
متن کاملProducts of random matrices and queueing system performance evaluation
We consider (max,+)-algebra products of random matrices, which arise from performance evaluation of acyclic fork-join queueing networks. A new algebraic technique to examine properties of the product and investigate its limiting behaviour is proposed based on an extension of the standard matrix (max,+)-algebra by endowing it with the ordinary matrix addition as an external operation. As an appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002